Learning directed Graph Shifts from High-Dimensional Time Series
نویسنده
چکیده
Graph Signal Processing is an emerging field of signal processing that combines classical signal processing with graph theory. There are two approaches which either use undirected weighted graphs that allow the usage of Laplacian matrix, or the more general approach, which is based on algebraic features, including all weighted directed graphs. We investigate the concept of causal graph signal processing that was proposed by J. Mei and J.M.F. Moura. In a causal graph process, the current signal depends on the past signals through graph filters that consist of a polynomial of the graph shift matrix. With their algorithm, the graph shift matrix and filter coefficients can be learned from a sequence of observed data vectors. We evaluate the performance for estimating the shift matrix from an artificially generated causal graph process. Furthermore, we apply the estimation algorithm on two real-world data sets. The first data set contains daily temperature data from different countries. In the second example, we tried to model Austrian stock prices with causal graph processes.
منابع مشابه
Online Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملHigh-Dimensional Non-Linear Variable Selection through Hierarchical Kernel Learning
We consider the problem of high-dimensional non-linear variable selection for supervised learning. Our approach is based on performing linear selection among exponentially many appropriately defined positive definite kernels that characterize non-linear interactions between the original variables. To select efficiently from these many kernels, we use the natural hierarchical structure of the pr...
متن کاملRegion Directed Diffusion in Sensor Network Using Learning Automata:RDDLA
One of the main challenges in wireless sensor network is energy problem and life cycle of nodes in networks. Several methods can be used for increasing life cycle of nodes. One of these methods is load balancing in nodes while transmitting data from source to destination. Directed diffusion algorithm is one of declared methods in wireless sensor networks which is data-oriented algorithm. Direct...
متن کاملRegion Directed Diffusion in Sensor Network Using Learning Automata:RDDLA
One of the main challenges in wireless sensor network is energy problem and life cycle of nodes in networks. Several methods can be used for increasing life cycle of nodes. One of these methods is load balancing in nodes while transmitting data from source to destination. Directed diffusion algorithm is one of declared methods in wireless sensor networks which is data-oriented algorithm. Direct...
متن کاملO ct 2 01 7 LEARNING DIRECTED ACYCLIC GRAPHS WITH PENALIZED NEIGHBOURHOOD REGRESSION
We study a family of regularized score-based estimators for learning the structure of a directed acyclic graph (DAG) for a multivariate normal distribution from high-dimensional data with p ≫ n. Our main results establish support recovery guarantees and deviation bounds for a family of penalized least-squares estimators under concave regularization without assuming prior knowledge of a variable...
متن کامل